Poisson statistics via the Chinese Remainder Theorem
نویسندگان
چکیده
We consider the distribution of spacings between consecutive elements in subsets of Z/qZ, where q is highly composite and the subsets are defined via the Chinese Remainder Theorem. We give a sufficient criterion for the spacing distribution to be Poissonian as the number of prime factors of q tends to infinity, and as an application we show that the value set of a generic polynomial modulo q has Poisson spacings. We also study the spacings of subsets of Z/q1q2Z that are created via the Chinese Remainder Theorem from subsets of Z/q1Z and Z/q2Z (for q1, q2 coprime), and give criteria for when the spacings modulo q1q2 are Poisson. Moreover, we also give some examples when the spacings modulo q1q2 are not Poisson, even though the spacings modulo q1 and modulo q2 are both Poisson. © 2008 Published by Elsevier Inc. MSC: primary 11N69; secondary 11K36
منابع مشابه
Information technology Image encryption algorithm based on chaotic mapping and Chinese remainder theorem
When the image data are regularly changed, existing image encryption algorithm is easy to be decrypted. In order to improve the security of encryption algorithm, this paper proposes an image encryption algorithm based on chaotic mapping and Chinese remainder theorem. The encryption algorithm is divided into pixel scrambling and image diffusion. Firstly, the Chebyshev mapping is used to generate...
متن کاملEnforcing RBAC Policies over Data Stored on Untrusted Server (Extended Version)
One of the security issues in data outsourcing is the enforcement of the data owner’s access control policies. This includes some challenges. The first challenge is preserving confidentiality of data and policies. One of the existing solutions is encrypting data before outsourcing which brings new challenges; namely, the number of keys required to access authorized resources, efficient policy u...
متن کاملComputing Igusa Class Polynomials via the Chinese Remainder Theorem
We present a new method for computing the Igusa class polynomials of a primitive quartic CM field. For a primitive quartic CM field, K, we compute the Igusa class polynomials modulo p for certain small primes p and then use the Chinese remainder theorem and a bound on the denominators to construct the class polynomials. We also provide an algorithm for determining endomorphism rings of Jacobian...
متن کاملEfficient Reverse Converter for Three Modules Set {2^n-1,2^(n+1)-1,2^n} in Multi-Part RNS
Residue Number System is a numerical system which arithmetic operations are performed parallelly. One of the main factors that affects the system’s performance is the complexity of reverse converter. It should be noted that the complexity of this part should not affect the earned speed of parallelly performed arithmetic unit. Therefore in this paper a high speed converter for moduli set {2n-1, ...
متن کاملEfficient Reverse Converter for Three Modules Set {2^n-1,2^(n+1)-1,2^n} in Multi-Part RNS
Residue Number System is a numerical system which arithmetic operations are performed parallelly. One of the main factors that affects the system’s performance is the complexity of reverse converter. It should be noted that the complexity of this part should not affect the earned speed of parallelly performed arithmetic unit. Therefore in this paper a high speed converter for moduli set {2n-1, ...
متن کامل